A Provably Secure t-out-of-n Oblivious Transfer Mechanism based on Blind Signature

نویسندگان

  • Chin-Chen Chang
  • Ting-Fang Cheng
  • T. F. Cheng
چکیده

Due to the rapid development of the Internet, an increasing number of applications can be implemented using oblivious transfer (OT) as a sub-protocol, such as privacy-preserving auction, secrets exchange, data mining, and e-commerce. Considering the practicability of an OT mechanism, we think that it is also necessary to discuss how to convince a chooser of the integrity and origin of chosen secrets, except for accuracy, privacy of the sender, and privacy of the chooser. In this paper, we redefine the requirements of a well-designed OT scheme and propose a novel t-out-of-n OT mechanism (OT t ) based on blind signature. The accuracy of our OT n t mechanism is demonstrated according to the BAN logic. Furthermore, we adopt the problem reduction to prove the security of our OT t mechanism. The analyses demonstrate that our proposed mechanism can fulfill all requirements that we redefined and be suitable for further applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Practical Simulatable Adaptive Oblivious Transfer Protocol

Oblivious Transfer protocol (OTP) is a primitive and also a paramount important tool in modern cryptography. An adaptive version of OTP named 1 OT N k is useful when a large database should be queried in an adaptive version. Due to its importance, the task of constructing efficient and secure 1 OT N k has attracted a lot interests. This paper presents a research roadmap to construct a practic...

متن کامل

Provably Secure Blind Threshold Signatures Based on Discrete Logarithm

In this paper, we propose a provably secure group-oriented blind (t, n) threshold signature scheme, which is the first scheme whose security is proved to be equivalent to the discrete logarithm problem in the random oracle model. Based on the scheme, any t out of n signers in a group can represent the group in signing blind threshold signatures, which can be used in anonymous digital e-cash sys...

متن کامل

Cryptography in an Unbounded Computational Model

We investigate the possibility of cryptographic primitives over nonclassical computational models. We replace the traditional finite field F ∗ n with the infinite field Q of rational numbers, and we give all parties unbounded computational power. We also give parties the ability to sample random real numbers. We determine that secure signature schemes and secure encryption schemes do not exist....

متن کامل

Artemia: a family of provably secure authenticated encryption schemes

Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...

متن کامل

An ECC-Based Mutual Authentication Scheme with One Time Signature (OTS) in Advanced Metering Infrastructure

Advanced metering infrastructure (AMI) is a key part of the smart grid; thus, one of the most important concerns is to offer a secure mutual authentication.  This study focuses on communication between a smart meter and a server on the utility side. Hence, a mutual authentication mechanism in AMI is presented based on the elliptic curve cryptography (ECC) and one time signature (OTS) consists o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013